Evaluating the impact of AND/OR search on 0-1 integer linear programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On aggregating binary relations using 0-1 integer linear programming

This paper is concerned with the general problem of aggregating many binary relations in order to find out a consensus. The theoretical background we rely on is the Relational Analysis (RA) approach. The latter method represents binary relations (BRs) as adjacency matrices, models relational properties as linear equations and finds a consensus by maximizing a majoritybased criterion using 0-1 i...

متن کامل

Best-First AND/OR Search for 0/1 Integer Programming

AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. In this paper we introduce an AND/OR search algorithm that explores a context-minimal AND/OR search graph in a best-first manner for so...

متن کامل

Proximity search for 0-1 mixed-integer convex programming

In this paper we investigate the effects of replacing the objective function of a 0-1 Mixed-Integer Convex Program (MIP) with a “proximity” one, with the aim of enhancing the heuristic behavior of a black-box solver. The relationship of this approach with primal integer methods is also addressed. Promising computational results on different proof-of-concept implementations are presented, sugges...

متن کامل

Pseudo-Boolean Heuristics for 0-1 Integer Linear Programming

Many Integer Linear Programming (ILP) problems contain significant subproblems exclusively composed of 0-1 (binary) variables. Much effort has gone in to special solvers for 0-1 ILP, as well as specialized versions of 0-1 ILP. The boolean satisfiability problem (SAT), is fundamental to many fields, including Artificial Intelligence, Formal Verification, and Computer Aided Design, and can be vie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Constraints

سال: 2009

ISSN: 1383-7133,1572-9354

DOI: 10.1007/s10601-009-9070-7